Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches?

نویسندگان

  • Víctor Sánchez-Anguix
  • Reyhan Aydogan
  • Tim Baarslag
  • Catholijn M. Jonker
چکیده

Traditionally, researchers in decision making have focused on attempting to reach Pareto Optimality using horizontal approaches, where optimality is calculated taking into account every participant at the same time. Sometimes, this may prove to be a difficult task (e.g., conflict, mistrust, no information sharing, etc.). In this paper, we explore the possibility of achieving Pareto Optimal outcomes in a group by using a bottom-up approach: discovering Pareto optimal outcomes by interacting in subgroups. We analytically show that Pareto optimal outcomes in a subgroup are also Pareto optimal in a supergroup of those agents in the case of strict , transitive, and complete preferences. Then, we empirically analyze the prospective usability and practicality of bottom-up approaches in a variety of decision making domains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A first step toward uncovering the truth about weight tuning in deformable image registration

Deformable image registration is currently predominantly solved by optimizing a weighted linear combination of objectives. Successfully tuning the weights associated with these objectives is not trivial, leading to trial-and-error approaches. Such an approach assumes an intuitive interplay between weights, optimization objectives, and target registration errors. However, it is not known whether...

متن کامل

Report on Satisfaction Equilibria ?

In real life problems, agents are generally faced with situations where they only have partial or no knowledge about their environment and the other agents evolving in it. So far, most game theory approaches have assumed that this knowledge about the other agents was known by all agents and that observations could be made about all the agents’ actions. In order to alleviate these assumptions, w...

متن کامل

Voting with Ties: Strong Impossibilities via SAT Solving

Voting rules allow groups of agents to aggregate their preferences in order to reach joint decisions. The Gibbard-Satterthwaite theorem, a seminal result in social choice theory, implies that, when agents have strict preferences, all anonymous, Pareto-optimal, and single-valued voting rules can be strategically manipulated. In this paper, we consider multi-agent voting when there can be ties in...

متن کامل

The Economic and Welfare Effects of Different irrigation Water Pricing Methods, Case study of khomein Plain in Markazi Province of Iran

The scarcity of water resources and supply resources limitation, have caused an increasing gap between water supply and demand specially in recent decades in almost all regions of the globe. One of the best known solutions proposed by the economists is using the different water pricing approaches thereby obtaining the optimal allocation and social justice. To this purpose, this paper uses the p...

متن کامل

Efficient Methods for Multi-agent Multi-issue Negotiation: Allocating Resources

In this paper, we present an automated multi-agent multi-issue negotiation solution to solve a resource allocation problem. We use a multilateral negotiation model, by which three agents bid sequentially in consecutive rounds till some deadline. Two issues are bundled and negotiated concurrently, so winwin opportunities can be generated as trade-offs exist between issues. We develop negotiation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016